Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
نویسندگان
چکیده
منابع مشابه
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
algorithm Iztok Fister,∗ Marjan Mernik,† and Bogdan Filipič‡ Abstract This paper proposes a hybrid self-adaptive evolutionary algorithm for graph coloring that is hybridized with the following novel elements: heuristic genotype-phenotype mapping, a swap local search heuristic, and a neutral survivor selection operator. This algorithm was compared with the evolutionary algorithm with the SAW met...
متن کاملGraph Coloring with Adaptive Evolutionary Algorithms
This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the fitness function during the evolution. This adaptive EA is general, using no ...
متن کاملA Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring
for Graph 3-Coloring Iztok Fister Jr.,∗ Iztok Fister,† and Janez Brest‡ Abstract The Artificial Bee Colony (ABC) is the name of an optimization algorithm that was inspired by the intelligent behavior of a honey bee swarm. It is widely recognized as a quick, reliable, and efficient methods for solving optimization problems. This paper proposes a hybrid ABC (HABC) algorithm for graph 3-coloring, ...
متن کاملHybrid Evolutionary Algorithms for Graph Coloring
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators and a well-known tabu search algorithm. Experiments of such a hybrid algorithm are carried out on...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2012
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-012-9496-5